FFT algorithms for SIMD parallel processing systems
نویسندگان
چکیده
منابع مشابه
FFT Algorithms for SIMD Parallel Processing Systems
SIMD (single instruction stream-multiple data stream) algorithms for one-and two-dimensional discrete Fourier transforms are presented. Parallel structurings of algorithms for efficient computation for a variety of machine size/problem size combinations are presented and analyzed. Through these algorithms, techniques for exploiting relationships between problem size and machine size are demonst...
متن کاملImplementation of parallel graph algorithms on a massively parallel SIMD computer with virtual processing
We describe our implementation of several PRAM graph algorithms on the massively parallel computer MasPar MP-1 with 16,384 processors. Our implementation incorporated virtual processing and we present extensive test data. In a previous project [13], we reported the implementation of a set of parallel graph algorithms with the constraint that the maximum input size was restricted to be no more t...
متن کاملImplementation of Parallel Graph Algorithms on aMassively Parallel SIMD
We describe our implementation of several PRAM graph algorithms on the massively parallel computer MasPar MP-1 with 16,384 processors. Our implementation incorporated virtual processing and we present extensive test data. In a previous project 13], we reported the implementation of a set of parallel graph algorithms with the constraint that the maximum input size was restricted to be no more th...
متن کاملA SIMD Vectorizing Compiler for Digital Signal Processing Algorithms
Short vector SIMD instructions on recent microprocessors, such as SSE on Pentium III and 4, speed up code but are a major challenge to software developers. We present a compiler that automatically generates C code enhanced with short vector instructions for digital signal processing (DSP) transforms, such as the fast Fourier transform (FFT). The input to our compiler is a concise mathematical d...
متن کاملNew SIMD Algorithms for Cluster Labeling on Parallel Computers
Cluster algorithms are non-local Monte Carlo update schemes which can greatly increase the efficiency of computer simulations of spin models of magnets. The major computational task in these algorithms is connected component labeling, to identify clusters of connected sites on a lattice. We have devised some new SIMD component labeling algorithms, and implemented them on the Connection Machine....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 1986
ISSN: 0743-7315
DOI: 10.1016/0743-7315(86)90027-4